Deployment of Constrained Delaunay Mesh in Vop Shape Coding
نویسنده
چکیده
The work presents an alternative method for encoding shape-information of video objects, which is a new requirement in the recent revolution of video codec scheme: compressing and transmitting object-based video streams. The proposed method takes the advantage of the latest development in the video encoding – motion compensation on the base of mesh presentation of frame – to complete its target. The so-called constrained Delaunay mesh is deployed to represent video objects, which are detected from a previous video object detector (in a consistent case of scene, detector can simply function like a segmenting phase of video frame). This special mesh structure in one hand constructs the base for successive motion compensation taking root on mesh-vertices. In another hand, the virtue of constrained property opens a possibility to encode the shape of video object implicitly, therefore it reduces the amount of transmitted information. With constrained Delaunay mesh, shape information of objects is presented with polygon, therefore lossy. The problem can be alleviated by increasing the number of boundary vertices at the cost of bandwidth. The work also puts a stress on controlling this trade-off. Results of integrating the proposed method into a full VOP codec scheme are encouraging.
منابع مشابه
Deployment of Constrained Delaunay Mesh in Vop Shape and Texture Coding
The work presents an alternative method for encoding shape-information of video objects, which is a new requirement in the recent revolution of video codec scheme: compressing and transmitting object-based video streams. The proposed method takes the advantage of the latest development in the video encoding — motion compensation on the base of mesh presentation of frame — to complete its target...
متن کامل1B.1 Interleaving Delaunay Refinement and Optimization for 2D Triangle Mesh Generation
We address the problem of generating 2D quality triangle meshes from a set of constraints provided as a planar straight line graph. The algorithm first computes a constrained Delaunay triangulation of the input set of constraints, then interleaves Delaunay refinement and optimization. The refinement stage inserts a subset of the Voronoi vertices and midpoints of constrained edges as Steiner poi...
متن کاملInterleaving Delaunay Refinement and Optimization for 2D Triangle Mesh Generation
We address the problem of generating 2D quality triangle meshes from a set of constraints provided as a planar straight line graph. The algorithm first computes a constrained Delaunay triangulation of the input set of constraints, then interleaves Delaunay refinement and optimization. The refinement stage inserts a subset of the Voronoi vertices and midpoints of constrained edges as Steiner poi...
متن کاملA Pliant Method for Anisotropic Mesh Generation
A new algorithm for the generation of anisotropic, unstructured triangular meshes in two dimensions is described. Inputs to the algorithm are the boundary geometry and a metric that specifies the desired element size and shape as a function of position. The algorithm is an example of what we call pliant mesh generation. It first constructs the constrained Delaunay triangulation of the domain, t...
متن کاملTriangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
A b s t r a c t . Triangle is a robust implementation of two-dimensional constrained Delaunay triangulation and Ruppert's Delaunay refinement algorithm for quality mesh generation. Several implementation issues are discussed, including the choice of triangulation algorithms and data structures, the effect of several variants of the Delaunay refinement algorithm on mesh quality, and the use of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003